Task Scheduling In Cloud Computing Research Articles

Task Scheduling in a Cloud Environment: A comparative Study

In this study, we explore the application of Monarch Butterfly Optimization (MBO) algorithms for task scheduling in cloud computing, comparing its performance against widely used optimization techniques, namely Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO).Task scheduling in the cloud is a critical aspect influencing resource utilization, turnaround time, and overall system efficiency. MBO, known for its effective exploration- exploitation balance, is examined for its suitability in addressing the complexities of cloud computing environments. The study investigates MBO's advantages, such as enhanced adaptability to dynamic conditions, effective handling of multi-objective optimization, and its consideration of bandwidth as a critical resource. Comparative analyses with ACO and PSO highlight MBO's superior performance in achieving near-optimal task schedules, emphasizing its potential to offer innovative solutions to the challenges posed by task scheduling in dynamic and resource-constrained cloud environments. This research contributes valuable insights into the strengths of MBO, paving the way for advancements in optimization methodologies tailored for cloud computing systems.

Optimizing task scheduling in cloud computing: a hybrid artificial intelligence approach

Optimizing task scheduling in cloud computing: a hybrid artificial intelligence approach

Enhancement in performance of cloud computing task scheduling using optimization strategies

Enhancement in performance of cloud computing task scheduling using optimization strategies

Resource allocation on periotity based schuduling and improve the security using DSSHA-256

Cloud computing has gained popularity with advancements in virtualization technology and the deployment of 5G. However, scheduling workload in a heterogeneous multi-cloud environment is a complicated process. Users of cloud services want to ensure that their data is secure and private, especially sensitive or proprietary information. Several research works have been proposed to solve the challenges associated with cloud computing. The proposed Adaptive Priority based scheduling (PBS) focuses on reducing data access completion time and computation expense for task scheduling in cloud computing. PBS assigns tasks depending on its size and selects the minimum cost path for data access. It contains a task register, scheduler, and task execution components for efficient task execution. The proposed system also executes a double signature mechanism for data privacy and security in data storage. This study correlates the perfo}rmance of three algorithms, PBS, (Task Requirement Degree) TRD and (recommended a Risk adaptive Access Control) RADAC, in terms of task execution time and makespan time. The experimental results demonstrate that PBS outperforms TRD and RADAC in both metrics, as the number of tasks increases. PBS has a minimum task execution time and a lower makespan time than the othertwo algorithms  

Hybrid Hierarchical Particle Swarm Optimization with Evolutionary Artificial Bee Colony Algorithm for Task Scheduling in Cloud Computing

Hybrid Hierarchical Particle Swarm Optimization with Evolutionary Artificial Bee Colony Algorithm for Task Scheduling in Cloud Computing

Damping-Assisted Evolutionary Swarm Intelligence for Industrial IoT Task Scheduling in Cloud Computing

Damping-Assisted Evolutionary Swarm Intelligence for Industrial IoT Task Scheduling in Cloud Computing

Optimizing Task Scheduling in Cloud Computing: An Enhanced Shortest Job First Algorithm

In the dynamic landscape of cloud computing, efficient task scheduling plays a pivotal role in optimizing resource utilization and enhancing overall system performance. This research introduces a groundbreaking approach to task scheduling in cloud environments through the implementation of a novel Modified Shortest Job First (SJF) algorithm within the CloudSim simulation framework. The primary objectives of this study are to address existing challenges in traditional scheduling algorithms, mitigate resource bottlenecks, reduce task completion times, and improve overall system efficiency.

Cloud Computing: Optimization using Particle Swarm Optimization to Improve Performance of Cloud

INTRODUCTION: In the contemporary world cloud computing is acknowledged as advanced technology to manage and store huge amount of data over the network. To handle the network traffic and effective task scheduling some efficient load balancing algorithm should be implemented. This can reduce the network traffic and overcome the problem of limited bandwidth. The various research articles represents ample amount of optimization techniques to overcome the transfer of data with limited bandwidth. Among all, few solutions has been chosen for current research article such as – optimization of load distribution of various resources provided by cloud.
 OBJECTIVES:  In this paper, Comparative analysis of various task scheduling algorithms such as (FCFS, SJF, Round Robin & PSO) have been proposed in current research article to accumulate the outcome and evaluate the overall performance of cloud at different number of processing elements (pesNumber) .
 METHODS: Overall performance of task scheduling is significantly enhanced by PSO Algorithm implemented on cloud in comparison of  FCFS, SJF and Round Robin. Outcomes of optimization technique has been implemented and tested over the CloudSim simulator.
 RESULTS: The comparative analysis conducted based on scalability for increasing the number of processing elements over the cloud. The major insight of proposed algorithm has shows that results are still better when number of VMs is increased and it successfully minimizes waiting time and turnaround time and completion time by 43% which is significantly high than outcomes of existing research articles.
 CONCLUSION: To optimize the task scheduling in cloud computing, comparative analysis of various task scheduling algorithms has been proposed, including Particle Swarm Optimization algorithm.

A Systematic Review on Various Task Scheduling Algorithms in Cloud Computing

Task scheduling in cloud computing involves allocating tasks to virtual machines based on factors such as node availability, processing power, memory, and network connectivity. In task scheduling, we have various scheduling algorithms that are nature-inspired, bio-inspired, and metaheuristic, but we still have latency issues because it is an NP-hard problem. This paper reviews the existing task scheduling algorithms modelled by metaheuristics, nature-inspired algorithms, and machine learning, which address various scheduling parameters like cost, response time, energy consumption, quality of services, execution time, resource utilization, makespan, and throughput, but do not address parameters like trust or fault tolerance. Trust and fault tolerance have an impact on task scheduling; trust is necessary for tasks and assigning responsibility to systems, while fault tolerance ensures that the system can continue to operate even when failures occur. A balance of trust and fault tolerance gives a quality of service and efficient task scheduling; therefore, this paper has analysed parameters like trust and fault tolerance and given research directions.

A chameleon and remora search optimization algorithm for handling task scheduling uncertainty problem in cloud computing

Task scheduling in cloud computing is responsible for serving the user requirements. The scheduling strategy must handle the problems of high load over virtual machines (VMs), high-cost consumption and lengthier scheduling time effectively. The greatest challenge in the cloud computing environment is achieving the intended outcome of task scheduling under the uncertain user request demands as it is responsible for assigning specific resources to requests for achieving effective task completion. However, most of the task scheduling approaches contributed to the literature mainly focused on the design and development of scheduling algorithms but ignored to explore the impact of uncertain factors such as millions of instructions per second (MIPS) and network bandwidth during the scheduling process. In this paper, A Chameleon and Remora Search Optimization Algorithm (CRSOA) is proposed for achieving efficient scheduling process by exploring the impact of MIPS and network bandwidth which directly affects the virtual machine (VM) performance. Further the work includes the uncertainty factors of task completion rate, load balance, scheduling cost and makespan in a simultaneous manner during the process of scheduling. It is formulated a multi-objective cloud task scheduling optimization model by integrating the merits of Chameleon Search Algorithm (CSA) and Remora Search Optimization Algorithm (RSOA) using a greedy methodology for simulating the real cloud computing task scheduling process. The simulation results evidently confirmed that the proposed CRSOA approach is minimizing the completion time and effective in handling the load balancing between the available VMs against other competitive metaheuristic task scheduling algorithms. The experimental investigation of this CRSOA confirmed its predominance in minimizing the makespan by 18.96%, cost by 22.18%, and degree of imbalance by 20.54%, compared to the baseline approaches with different number of tasks and VMs.

Exploring swarm intelligence optimization techniques for task scheduling in cloud computing: algorithms, performance analysis, and future prospects

Exploring swarm intelligence optimization techniques for task scheduling in cloud computing: algorithms, performance analysis, and future prospects

Optimized Deep Learning Schemes for Secured Resource Allocation and Task Scheduling in Cloud Computing - A Survey

Scheduling involves allocating shared resources gradually so that tasks can be completed within a predetermined time frame. In Task Scheduling (TS) and Resource Allocation (RA), the phrase is used independently for tasks and resources. Scheduling is widely used for Cloud Computing (CC), computer science, and operational management. Effective scheduling ensures that systems operate efficiently, decisions are made effectively, resources are used efficiently, costs are kept to a minimum, and productivity is increased. High energy consumption, lower CPU utilization, time consumption, and low robustness are the most frequent problems in TS and RA in CC. In this survey, RA and TS based on deep learning (DL) and machine learning (ML) were discussed. Additionally, look into the methods employed by DL-based RA and TS-based CC. Additionally, the benefits, drawbacks, advantages, disadvantages, and merits are explored. The work's primary contribution is an analysis and assessment of DL-based RA and TS methodologies that pinpoint problems with cloud computing.

Optimizing Task Scheduling in Cloud Computing Environments using Hybrid Swarm Optimization

Cloud computing has revolutionized the Information Technology (IT) landscape by offering on-demand access to a shared pool of computing resources over the internet. Effective task scheduling is pivotal in optimizing resource utilization and enhancing the overall performance of cloud systems. Tasks are allocated to virtual machines (VMs) based on a server's workload capacity, aiming to minimize traffic congestion and waiting times. Although Particle Swarm Optimization (PSO) is currently the most effective algorithm for task scheduling in cloud environments, this study introduces a Hybrid Swarm Optimization (HSO) algorithm that combines the strengths of PSO and Salp Swarm Optimization (SSO). The proposed hybrid algorithm addresses the challenges associated with task scheduling in cloud computing. The performance of the HSO algorithm is evaluated using the CloudSim simulator and compared against traditional scheduling algorithms. Simulation results indicate that the hybrid PSO-SSO algorithm outperforms existing methods regarding makespan time, cloud throughput, and task execution efficiency. Consequently, the hybrid approach significantly improves resource utilization and overall system performance in cloud computing environments.

A Discrete Prey–Predator Algorithm for Cloud Task Scheduling

Cloud computing is considered a key Internet technology. Cloud providers offer services through the Internet, such as infrastructure, platforms, and software. The scheduling process of cloud providers’ tasks concerns allocating clients’ tasks to providers’ resources. Several mechanisms have been developed for task scheduling in cloud computing. Still, these mechanisms need to be optimized for execution time and makespan. This paper presents a new task-scheduling mechanism based on Discrete Prey–Predator to optimize the task-scheduling process in the cloud environment. The proposed Discrete Prey–Predator mechanism assigns each scheduling solution survival values. The proposed mechanism denotes the prey’s maximum surviving value and the predator’s minimum surviving value. The proposed Discrete Prey–Predator mechanism aims to minimize the execution time of tasks in cloud computing. This paper makes a significant contribution to the field of cloud task scheduling by introducing a new mechanism based on the Discrete Prey–Predator algorithm. The Discrete Prey–Predator mechanism presents distinct advantages, including optimized task execution, as the mechanism is purpose-built to optimize task execution times in cloud computing, improving overall system efficiency and resource utilization. Moreover, the proposed mechanism introduces a survival-value-based approach, as the mechanism introduces a unique approach for assigning survival values to scheduling solutions, differentiating between the prey’s maximum surviving value and the predator’s minimum surviving value. This improvement enhances decision-making precision in task allocation. To evaluate the proposed mechanism, simulations using the CloudSim simulator were conducted. The experiment phase considered different scenarios for testing the proposed mechanism in different states. The simulation results revealed that the proposed Discrete Prey–Predator mechanism has shorter execution times than the firefly algorithm. The average of the five execution times of the Discrete Prey–Predator mechanism was 270.97 s, while the average of the five execution times of the firefly algorithm was 315.10 s.

A Novel Hybrid MSA-CSA Algorithm for Cloud Computing Task Scheduling Problems

Recently, the dynamic distribution of resources and task scheduling has played a critical role in cloud computing to achieve maximum storage and performance. The allocation of computational tasks in the cloud is a complicated process that can be affected by some factors, such as available network bandwidth, makespan, and cost considerations. However, these allocations are always non-symmetric. Therefore, it is crucial to optimize available bandwidth for efficient cloud computing task scheduling. In this research, a novel swarm-based task scheduling with a security approach is proposed to optimize the distribution of tasks using available resources and encode cloud information during task scheduling. It can combine the Moth Swarm Algorithm (MSA) with the Chameleon Swarm Algorithm (CSA) for the task scheduling process and utilizes the Polymorphic Advanced Encryption Standard (P-AES) for information security of cloud scheduled tasks. The approach offers a new perspective for utilizing swarm intelligence algorithms to optimize cloud task scheduling. The integration of MSA and CSA with P-AES enables the approach to provide efficient and secure task scheduling by exploiting the strengths of used algorithms. The study evaluates the performance of the proposed approach in terms of the degree of imbalance, makespan, resource utilization, cost, average waiting time, response time, throughput, latency, execution time, speed, and bandwidth utilization. The simulation is carried out using a wide range of tasks from 1000 to 5000. The results show that the approach provides an innovative solution to the challenges of task scheduling in cloud environments and improves the performance of cloud services in terms of effectiveness and security measures.

OptiDJS+: A Next-Generation Enhanced Dynamic Johnson Sequencing Algorithm for Efficient Resource Scheduling in Distributed Overloading within Cloud Computing Environment

The continuously evolving world of cloud computing presents new challenges in resource allocation as dispersed systems struggle with overloaded conditions. In this regard, we introduce OptiDJS+, a cutting-edge enhanced dynamic Johnson sequencing algorithm made to successfully handle resource scheduling challenges in cloud computing settings. With a solid foundation in the dynamic Johnson sequencing algorithm, OptiDJS+ builds upon it to suit the demands of modern cloud infrastructures. OptiDJS+ makes use of sophisticated optimization algorithms, heuristic approaches, and adaptive mechanisms to improve resource allocation, workload distribution, and task scheduling. To obtain the best performance, this strategy uses historical data, dynamic resource reconfiguration, and adaptation to changing workloads. It accomplishes this by utilizing real-time monitoring and machine learning. It takes factors like load balance and make-up into account. We outline the design philosophies, implementation specifics, and empirical assessments of OptiDJS+ in this work. Through rigorous testing and benchmarking against cutting-edge scheduling algorithms, we show the better performance and resilience of OptiDJS+ in terms of reaction times, resource utilization, and scalability. The outcomes underline its success in reducing resource contention and raising service quality generally in cloud computing environments. In contexts where there is distributed overloading, OptiDJS+ offers a significant advancement in the search for effective resource scheduling solutions. Its versatility, optimization skills, and improved decision-making procedures make it a viable tool for tackling the resource allocation issues that cloud service providers and consumers encounter daily. We think that OptiDJS+ opens the way for more dependable and effective cloud computing ecosystems, assisting in the full realization of cloud technologies’ promises across a range of application areas. In order to use the OptiDJS+ Johnson sequencing algorithm for cloud computing task scheduling, we provide a two-step procedure. After examining the links between the jobs, we generate a Gantt chart. The Gantt chart graph is then changed into a two-machine OptiDJS+ Johnson sequencing problem by assigning tasks to servers. The OptiDJS+ dynamic Johnson sequencing approach is then used to minimize the time span and find the best sequence of operations on each server. Through extensive simulations and testing, we evaluate the performance of our proposed OptiDJS+ dynamic Johnson sequencing approach with two servers to that of current scheduling techniques. The results demonstrate that our technique greatly improves performance in terms of makespan reduction and resource utilization. The recommended approach also demonstrates its ability to scale and is effective at resolving challenging work scheduling problems in cloud computing environments.

Task scheduling optimization in heterogeneous cloud computing environments: A hybrid GA-GWO approach

Cloud computing, a technology providing flexible and scalable computing resources, faces a critical challenge in task scheduling, directly impacting system performance and customer satisfaction. The task scheduling problem's NP-completeness makes finding solutions difficult. To address this, researchers propose a hybrid algorithm combining the Grey Wolf Optimization Algorithm (GWO) and the Genetic Algorithm (GA). The hybrid GWO-GA algorithm targets multi-objective task scheduling in cloud computing, aiming to minimize makespan, energy consumption, and cost. Enhancements to the proposed algorithm involve leveraging the genetic algorithm's crossover and mutation operator. Furthermore, the GA-based GWO algorithm's faster convergence in large scheduling problems presents an advantage. Evaluation using the Cloudsim toolkit demonstrates the proposed algorithm's efficiency compared to existing methods. We have used both synthetic and real world data set. The results are verified using the Analysis of Variance (ANOVA) statistical tool. Experimental results showcase its effectiveness in minimizing makespan, energy consumption, and computational cost. Particularly, the proposed algorithm outperforms traditional GWO, GA, and PSO algorithms in terms of makespan, cost, and energy consumption, achieving reductions of 19%, 21%, and 15%, respectively, when compared to each approach. Additionally, it yields energy savings of 17%, 19%, and 23% compared to GWO, GA, and PSO, respectively, while reducing total scheduling costs by 13%, 17%, and 22%. These findings demonstrate the efficacy of the proposed algorithm in addressing the task scheduling problem in cloud computing environments.

A Deep Reinforcement Learning-Based Model for Optimal Resource Allocation and Task Scheduling in Cloud Computing

The advent of cloud computing has dramatically altered how information is stored and retrieved. However, the effectiveness and speed of cloud-based applications can be significantly impacted by inefficiencies in the distribution of resources and task scheduling. Such issues have been challenging, but machine and deep learning methods have shown great potential in recent years. This paper suggests a new technique called Deep Q-Networks and Actor-Critic (DQNAC) models that enhance cloud computing efficiency by optimizing resource allocation and task scheduling. We evaluate our approach using a dataset of real-world cloud workload traces and demonstrate that it can significantly improve resource utilization and overall performance compared to traditional approaches. Furthermore, our findings indicate that deep reinforcement learning (DRL)-based methods can be potent and effective for optimizing cloud computing, leading to improved cloud-based application efficiency and flexibility.

Task Scheduling Mechanism Based on Reinforcement Learning in Cloud Computing

The explosive growth of users and applications in IoT environments has promoted the development of cloud computing. In the cloud computing environment, task scheduling plays a crucial role in optimizing resource utilization and improving overall performance. However, effective task scheduling remains a key challenge. Traditional task scheduling algorithms often rely on static heuristics or manual configuration, limiting their adaptability and efficiency. To overcome these limitations, there is increasing interest in applying reinforcement learning techniques for dynamic and intelligent task scheduling in cloud computing. How can reinforcement learning be applied to task scheduling in cloud computing? What are the benefits of using reinforcement learning-based methods compared to traditional scheduling mechanisms? How does reinforcement learning optimize resource allocation and improve overall efficiency? Addressing these questions, in this paper, we propose a Q-learning-based Multi-Task Scheduling Framework (QMTSF). This framework consists of two stages: First, tasks are dynamically allocated to suitable servers in the cloud environment based on the type of servers. Second, an improved Q-learning algorithm called UCB-based Q-Reinforcement Learning (UQRL) is used on each server to assign tasks to a Virtual Machine (VM). The agent makes intelligent decisions based on past experiences and interactions with the environment. In addition, the agent learns from rewards and punishments to formulate the optimal task allocation strategy and schedule tasks on different VMs. The goal is to minimize the total makespan and average processing time of tasks while ensuring task deadlines. We conducted simulation experiments to evaluate the performance of the proposed mechanism compared to traditional scheduling methods such as Particle Swarm Optimization (PSO), random, and Round-Robin (RR). The experimental results demonstrate that the proposed QMTSF scheduling framework outperforms other scheduling mechanisms in terms of the makespan and average task processing time.

Multiple Resource Attributes and Conditional Logic Assisted Task Scheduling in Cloud Computing

Multiple Resource Attributes and Conditional Logic Assisted Task Scheduling in Cloud Computing